Efficient Scaling-Invariant Checking of Timed Bisimulation
نویسندگان
چکیده
Bisimulation is an important notion for the veriication of distributed systems. Timed bisimulation is its natural extension to real time systems. Timed bisimulation is known to be decidable for timed au-tomata using the so-called region technique. We present a new, top down approach to timed bisimulation which applies the zone technique from the theory of hybrid systems. In contrast to the original decision algorithm , our method has a better space complexity and is scaling invariant: altering the time scale does not eeect the space complexity.
منابع مشابه
On Characteristic Formulae for Event-Recording Automata
A standard bridge between automata theory and logic is provided by the notion of characteristic formula. This paper investigates this problem for the class of event-recording automata (ERA), a subclass of timed automata in which clocks are associated with actions and that enjoys very good closure properties (complementation, determinization...). We first study the problem of expressing characte...
متن کاملTimed Modal Logics for Specifying and Verifying Real-Time Systems
The timed modal logic Lν has been proposed in order to express timed properties over real-time systems modeled as (compositions of) timed automata. In this paper, we present a short survey of results about Lν : complexity of model checking, expressivity, compositional methods, relationship with strong timed bisimulation etc. We also show how Lν can be extended in order to express new properties.
متن کاملReducing Clocks in Timed Automata while Preserving Bisimulation
Model checking timed automata becomes increasingly complex with the increase in the number of clocks. Hence it is desirable that one constructs an automaton with the minimum number of clocks possible. The problem of checking whether there exists a timed automaton with a smaller number of clocks such that the timed language accepted by the original automaton is preserved is known to be undecidab...
متن کاملModel-Checking for Weighted Timed Automata
We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with costs on both edges and locations. When the costs act as stopwatches, we get stopwatch automata with the restriction that the stopwatches cannot be reset and tested. The weighted CTL logic is an extension of TCTL that a...
متن کاملProject Acronym : QUASIMODO Deliverable no . : D 2 . 1 Title of Deliverable : Model - checking of real - time probabilistic models
This deliverable describes the first year results of the QUASIMODO project on analysing quantitative systems. Keyword list: Markov chain, Markov decision process, probabilistic bisimulation, probabilistic simulations; probabilistic timed automata; priced probabilistic timed automata; Continuous Time Markov Chains, inhomogeneous CTMC, Infinite state CTMC, counter-example guided abstractionrefine...
متن کامل